منابع مشابه
Random logic programs: Linear model
This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a random program converges to a constant when the number of atoms approaches infinity. Several experimental results are also reported, which jus...
متن کاملSimple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” programs with two-literal rules have answer sets. We study experimentally how hard it is to compute answer sets of such programs. For programs that are constraint-free and purely negative we show that the easy-hard-easy pattern...
متن کاملLearning Logic Programs with Random Classification Noise
We consider the learnability of classes of logic programs in the presence of noise, assuming that the label of each example is reversed with a xed probability. We review the polynomial PAC learnability of nonrecursive, determinate, constant-depth Horn clauses in the presence of such noise. This result is extended to an analogous class of recursive logic programs that consist of a recursive clau...
متن کاملDecomposition of Linear Recursive Logic Programs
In practise, most recursive logic queries to a deductive database are expressed by linear recursive datalog programs with exactly one linear recursive rule, so-called linear datalog sirups. The notion of k-sided linear datalog sirups has been introduced by Naughton, who characterized one-sided linear datalog sirups based on a graph model. We use another graph representation of linear datalog si...
متن کاملOn Transformations into Linear Database Logic Programs
We consider the problem of transformations of logic pro grams without function symbols database logic programs into a special subclass namely linear logic programs Linear logic programs are de ned to be the programs whose rules have at most one intentional atom in their bodies a We investigate linearizability of several syntactically de ned subclasses of programs and present both positive and n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2014
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068414000611